$\mathbb{Z}_2\mathbb{Z}_4$-additive perfect codes in Steganography
نویسندگان
چکیده
منابع مشابه
ℤ2ℤ4-additive perfect codes in Steganography
Steganography is an information hiding application which aims to hide secret data imperceptibly into a cover object. In this paper, we describe a novel coding method based on Z2Z4-additive codes in which data is embedded by distorting each cover symbol by one unit at most (±1-steganography). This method is optimal and solves the problem encountered by the most efficient methods known today, con...
متن کاملPerfect Z2Z4-linear codes in Steganography
Steganography is an information hiding application which aims to hide secret data imperceptibly into a commonly used media. Unfortunately, the theoretical hiding asymptotical capacity of steganographic systems is not attained by algorithms developed so far. In this paper, we describe a novel coding method based on Z2Z4-linear codes that conforms to ±1-steganography, that is secret data is embed...
متن کاملPerfect Z2Z4-linear codes applied to steganography
Steganography aims to hide secret data imperceptibly into a cover object. We describe a novel method based on Z2Z4-linear codes in which data is embedded by distorting each cover symbol by one unit at most (±1-steganography). This method solves the problem encountered by the most efficient methods known today, concerning the treatment of boundary values. Moreover, a generalization of the produc...
متن کاملProduct Perfect Codes and Steganography 1
A new coding technique to be used in steganography is evaluated. The performance of this new technique is computed and comparisons with the well-known theoretical upper bound, Hamming upper bound and basic LSB are established.
متن کاملOn the intersection of additive perfect codes
The intersection problem for additive (extended and non-extended) perfect codes, i.e. which are the possibilities for the number of codewords in the intersection of two additive codes C1 and C2 of the same length, is investigated. Lower and upper bounds for the intersection number are computed and, for any value between these bounds, codes which have this given intersection value are constructe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics of Communications
سال: 2011
ISSN: 1930-5346
DOI: 10.3934/amc.2011.5.425